#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<cstdio>
#include <ctime>
#include<cassert>
#include <pthread.h>


using namespace std;

#define MEM(a,b) memset(a,(b),sizeof(a))
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#define MP make_pair
#define pb push_back


#define maxn 10000
#define maxt 100
#define maxv 1000000

typedef long long  LL;

typedef pair<int,int> pi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pi> vpi;

LL f1( LL n )
{
	if ( n < 2 ) return 0;
	return n * (n - 1) * (n - 1);
}

LL f2( LL n )
{
	if ( n < 3 ) return 0;
	return n * (n - 1) * (n - 2);
}

LL f3( LL n )
{
	if ( n < 3 ) return 0;
	return n * (n - 1) * (n - 2) * (n - 2);
}

int main()
{
   int i,j,k,n,T,m;


  scanf("%d",&T);
  assert(T>=1 && T<=10000);
  while(T--)
  {
     scanf("%d",&n);
     assert(n>=1 && n<=10000);
     LL ans=2*f1(n) + f2(n) + 2*f3(n);
     cout<<ans<<endl;
  }

	return 0;
}